automaton$6084$ - tradução para árabe
Diclib.com
Dicionário ChatGPT
Digite uma palavra ou frase em qualquer idioma 👆
Idioma:

Tradução e análise de palavras por inteligência artificial ChatGPT

Nesta página você pode obter uma análise detalhada de uma palavra ou frase, produzida usando a melhor tecnologia de inteligência artificial até o momento:

  • como a palavra é usada
  • frequência de uso
  • é usado com mais frequência na fala oral ou escrita
  • opções de tradução de palavras
  • exemplos de uso (várias frases com tradução)
  • etimologia

automaton$6084$ - tradução para árabe

CHESS-PLAYING "PSEUDO-AUTOMATON" BUILT IN 1876
Mephisto (Automaton); Mephisto automaton

automaton      
n. إنسان أوتوماتيكي, إنسان آلي, آلة ذات حركة ذاتية, شخص يعمل بطريقة روتينية
cellular automata         
  • Rule 110
  • Rule 30
  • Visualization of a lattice gas automaton. The shades of grey of the individual pixels are proportional to the gas particle density (between 0 and 4) at that pixel. The gas is surrounded by a shell of yellow cells that act as reflectors to create a closed space.
  • Los Alamos]] ID badge
  • An animation of the way the rules of a 1D cellular automaton determine the next generation.
  • A cellular automaton based on hexagonal cells instead of squares (rule 34/2)
  • ''[[Conus textile]]'' exhibits a cellular automaton pattern on its shell.<ref name=coombs/>
  • A [[torus]], a toroidal shape
DISCRETE MODEL STUDIED IN COMPUTABILITY THEORY, MATHEMATICS, PHYSICS, COMPLEXITY SCIENCE, THEORETICAL BIOLOGY AND MICROSTRUCTURE MODELING
Seluler Atomatons; Cellular image processing; Cellular autonoma; Cellular Automata; Cellular Automaton; Celullar automaton; Cellular Automata machine; Cellular robotics; Cell games (cellular automaton); Cellular automata machine; Cellular automota; Cellular automata; Cellular automata in popular culture; Fuzzy cellular automata; Fuzzy cellular automaton; Non-totalistic; Applications of cellular automata; Totalistic cellular automata; Cellular automaton theory; Cellular automatons; Tessellation automata
ميكنة خلوية .
RECOGNIZER         
  • TTL]] counter, a type of state machine
  • Fig. 5: Representation of an acceptor; this example shows one that determines whether a binary number has an even number of 0s, where ''S''<sub>1</sub> is an ''accepting state'' and ''S''<sub>2</sub> is a ''non accepting state''.
  • Fig. 3 Example of a simple finite-state machine
  • Fig. 6 Transducer FSM: Moore model example
  • Fig. 7 Transducer FSM: Mealy model example
  • Fig. 4: Acceptor FSM: parsing the string "nice".
  • Fig. 2 SDL state machine example
  • A turnstile
  • State diagram for a turnstile
  • Fig. 1 UML state chart example (a toaster oven)
MATHEMATICAL MODEL OF COMPUTATION; ABSTRACT MACHINE THAT CAN BE IN EXACTLY ONE OF A FINITE NUMBER OF STATES AT ANY GIVEN TIME
Finite state machines; Finite state automaton; Finite automaton; Finite state automata; Start state; Finite automata; Deterministic automata; State machine; SFSM; Finite State Machine; Finate state automata; Accept state; Accepting state; State Machine; State machines; Recognizer; Recognizers; Sequence detector; Sequence detectors; Finite state acceptor; Finite State Automaton; State transition function; Finite State Machines; Finite-state automata; Finite-state automaton; Finite state machine; Finite state grammar; Finite-state machines; Finite state-machine; Finite state language; Finite state; Finite Automata; Finite state recognizer; Finite-state recognizer; State-machine; Acceptor (finite-state machine); Optimization of finite state machines; Recogniser

ألاسم

إِثْبات ; أَدِلَّة ; إِفَاقَة ; إِقْرار ; اِسْتِيقَاظ ; اِنْتِباه ; بَرْهَنَة ; تَفْرِيق ; تَمْيِيز ; تَنَبُّه ; تَيَقُّظ ; حَذَر ; دِرَايَة ; سَهَر ; شُعُور ; صَحْو ; عِلْم ; عَهْد ; فِقْه ; فَهْم ; مَعْرِفَة ; وَعْي ; يَقَظَة

Definição

cellular automaton
<algorithm, parallel> (CA, plural "- automata") A regular spatial lattice of "cells", each of which can have any one of a finite number of states. The state of all cells in the lattice are updated simultaneously and the state of the entire lattice advances in discrete time steps. The state of each cell in the lattice is updated according to a local rule which may depend on the state of the cell and its neighbors at the previous time step. Each cell in a cellular automaton could be considered to be a finite state machine which takes its neighbours' states as input and outputs its own state. The best known example is J.H. Conway's game of Life. {FAQ (http://alife.santafe.edu/alife/topics/cas/ca-faq/ca-faq.html)}. Usenet newsgroups: news:comp.theory.cell-automata, news:comp.theory.self-org-sys. (1995-03-03)

Wikipédia

Mephisto (automaton)

Mephisto was the name given to a chess-playing "pseudo-automaton" built in 1876. Unlike The Turk and Ajeeb it had no hidden operator, instead being remotely controlled by electromechanical means.

Constructed by Charles Godfrey Gumpel (c.1835 - 1921), an Alsatian manufacturer of artificial limbs, it took some 6 or 7 years to build and was first shown in 1878 at Gumpel's home in Leicester Square, London. Mephisto was mainly operated by chess master Isidor Gunsberg.